Self-dual Codes from Smaller Lengths of Self-dual Codes and Recursive Algorithm*
نویسندگان
چکیده
Self-dual codes have been received great attention by researchers since the beginning of the coding theory. In this work, some construction methods for this kind of codes are composed which produce new self-dual codes from self-dual codes of smaller lengths. A special one of these methods that is called recursive algorithm is also mentioned. For the binary case, it was shown that recursive algorithm is actually same with another so-called building-up construction method. This comparison is mentioned here.
منابع مشابه
New MDS or near MDS self-dual codes over finite fields
The study of MDS self-dual codes has attracted lots of attention in recent years. There are many papers on determining existence of q−ary MDS self-dual codes for various lengths. There are not existence of q−ary MDS self-dual codes of some lengths, even these lengths < q. We generalize MDS Euclidean self-dual codes to near MDS Euclidean self-dual codes and near MDS isodual codes. And we obtain ...
متن کاملClassification of Extremal and -Extremal Binary Self-Dual Codes of Length 38
In this paper we classify all extremal and -extremal binary self-dual codes of length 38. There are exactly 2744 extremal self-dual codes, two -extremal codes, and 1730 -extremal codes. We obtain our results from the use of a recursive algorithm used in the recent classification of all extremal self-dual codes of length 36, and from a generalization of this recursive algorithm for the shadow. T...
متن کاملClassification of extremal and $s$-extremal binary self-dual codes of length 38
Abstract—In this paper we classify all extremal and s-extremal binary self-dual codes of length 38. There are exactly 2744 extremal [38, 19, 8] self-dual codes, two s-extremal [38, 19, 6] codes, and 1730 s-extremal [38, 19, 8] codes. We obtain our results from the use of a recursive algorithm used in the recent classification of all extremal self-dual codes of length 36, and from a generalizati...
متن کاملSelf-Dual codes from $(-1, 1)$-matrices of skew symmetric type
Abstract. Previously, self-dual codes have been constructed from weighing matrices, and in particular from conference matrices (skew and symmetric). In this paper, codes constructed from matrices of skew symmetric type whose determinants reach the EhlichWojtas’ bound are presented. A necessary and sufficient condition for these codes to be self-dual is given, and examples are provided for lengt...
متن کاملConstruction of new extremal self-dual codes
In this paper, new binary extremal self-dual codes are presented. A number of new extremal singly-even self-dual codes of lengths 48; 64 and 78, and extremal doubly-even self-dual codes of lengths 80 and 88, are constructed. We also relate an extremal doubly-even self-dual code of length divisible by 24 to an extremal singly-even self-dual code of that length. New singly-even self-dual codes of...
متن کامل